Chain-constrained spanning trees

We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible. Iterative rounding has become the tool of choice for constrained spanning tree problems. However, iterative rounding approaches are very hard to adapt to settings where an edge can be part of more than a constant number of constraints. We consider a natural constrained spanning tree problem of this type, namely where upper bounds are imposed on a family of cuts forming a chain. Our approach reduces the problem to a family of independent matroid intersection problems, leading to a spanning tree that violates each constraint by a factor of at most 9. We also present strong hardness results: among other implications, these are the first to show, in the setting of a basic constrained spanning tree problem, a qualitative difference between what can be achieved when allowing multiplicative as opposed to additive constraint violations. This project was supported by NSF Grant CCF-1115849, an NWO Veni grant, and Swiss National Science Foundation Grant 200021_165866. B Neil Olver [email protected]; [email protected] Rico Zenklusen [email protected] 1 Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 2 CWI, Amsterdam, The Netherlands 3 ETH Zurich, Zurich, Switzerland